Generating the triangulations of the projective plane
نویسنده
چکیده
A theorem of Steinitz [2] states that the triangulations of the 2-sphere can be generated from the triangulation S with four vertices by a process called vertex splitting. That is, given any triangulation T of the 2sphere, there is a sequence of triangulations S = T,, T, ,..., T,_, , T,, = T, such that each triangulation except T, is obtained from its predecessor by vertex splitting. In this paper we show that the triangulations of the projective plane can be generated by the same process from two particular triangulations of the projective plane.
منابع مشابه
Counting polygon dissections in the projective plane
For each value of k ≥ 2, we determine the number pn of ways of dissecting a polygon in the projective plane into n subpolygons with k + 1 sides each. In particular, if k = 2 we recover a result of Edelman and Reiner (1997) on the number of triangulations of the Möbius band having n labelled points on its boundary. We also solve the problem when the polygon is dissected into subpolygons of arbit...
متن کاملDiagonal flips in Hamiltonian triangulations on the projective plane
In this paper, we shall prove that any two triangulations on the projective plane with n vertices can be transformed into each other by at most 8n− 26 diagonal flips, up to isotopy. To prove it, we focus on triangulations on the projective plane with contractible Hamilton cycles. © 2005 Elsevier B.V. All rights reserved.
متن کاملPolychromatic 4-coloring of cubic even embeddings on the projective plane
A polychromatic k-coloring of a map G on a surface is a k-coloring such that each face of G has all k colors on its boundary vertices. An even embedding G on a surface is a map of a simple graph on the surface such that each face of G is bounded by a cycle of even length. In this paper, we shall prove that a cubic even embedding G on the projective plane has a polychromatic proper 4-coloring if...
متن کاملColoring Eulerian triangulations of the projective plane
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given.
متن کاملGenerating All Triangulations of Plane Graphs
In this paper, we deal with the problem of generating all triangulations of plane graphs. We give an algorithm for generating all triangulations of a triconnected plane graph G of n vertices. Our algorithm establishes a tree structure among the triangulations of G, called the “tree of triangulations,” and generates each triangulation of G in O(1) time. The algorithm uses O(n) space and generate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 33 شماره
صفحات -
تاریخ انتشار 1982